منابع مشابه
The Representational Power of Discrete Bayesian Networks
One of the most important fundamental properties of Bayesian networks is the representational power, re ecting what kind of functions they can or cannot represent. In this paper, we establish an association between the structural complexity of Bayesian networks and their representational power. We use the maximum number of nodes' parents as the measure for the Bayesian network structural comple...
متن کاملApproximating discrete probability distributions with Bayesian networks
I generalise the arguments of [Chow & Liu 1968] to show that a Bayesian network satisfying some arbitrary constraint that best approximates a probability distribution is one for which mutual information weight is maximised. I give a practical procedure for finding an approximation network. The plan is first to discuss the approximation problem and its link with Bayesian network theory. After id...
متن کاملTowards Being Discrete in Naive Bayesian Networks
Bayesian networks are often used in problem domains that include variables of a continuous nature. For capturing such variables, their value ranges basically have to be modelled as finite sets of discrete values. While the output probabilities and conclusions established from a network are dependent of the actual discretisations used for its variables, the effects of choosing alternative discre...
متن کاملSensitivity analysis in discrete Bayesian networks
The paper presents an efficient computational method for performing sensitivity analysis in discrete Bayesian networks. The method exploits the structure of conditional probabilities of a target node given the evidence. First, the set of parameters which are relevant to the calculation of the conditional probabilities of the target node is identified. Next, this set is reduced by removing those...
متن کاملLearning Discrete Bayesian Networks from Continuous Data
Real data often contains a mixture of discrete and continuous variables, but many Bayesian network structure learning and inference algorithms assume all random variables are discrete. Continuous variables are often discretized, but the choice of discretization policy has significant impact on the accuracy, speed, and interpretability of the resulting models. This paper introduces a principled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2018
ISSN: 0090-5364
DOI: 10.1214/17-aos1631